An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form

نویسندگان

  • Marc Van Barel
  • Raf Vandebril
  • Nicola Mastronardi
چکیده

An orthogonal similarity reduction of a matrix to semiseparable form. Abstract It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation into tridiagonal form. Once the tridiagonal matrix has been computed, several algorithms can be used to compute either the whole spectrum or part of it. In this paper, we propose an algorithm to reduce any symmetric matrix into a similar semiseparable one of semiseparability rank 1, by orthogonal similarity transformations. A remarkable feature of the algorithm is that, after few steps of it, the largest eigenvalues, in absolute value, are already computed with high precision. Once the semiseparable matrix has been computed, to compute the whole spectrum either the same algorithm can be iterated or algorithms for computing the eigendecomposition of diagonal plus semiseparable matrices, available in the literature, can be used. These features of the proposed algorithm are confirmed by some numerical experiments. An orthogonal similarity reduction of a matrix to semiseparable form. * Abstract. It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation into tridiagonal form. Once the tridiagonal matrix has been computed, several algorithms can be used to compute either the whole spectrum or part of it. In this paper, we propose an algorithm to reduce any symmetric matrix into a similar semiseparable one of semiseparability rank 1, by orthogonal similarity transformations. A remarkable feature of the algorithm is that, after few steps of it, the largest eigenvalues, in absolute value, are already computed with high precision. Once the semiseparable matrix has been computed, to compute the whole spectrum either the same algorithm can be iterated or algorithms for computing the eigendecomposition of diagonal plus semiseparable matrices, available in the literature, can be used. These features of the proposed algorithm are confirmed by some numerical experiments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal

It is well-known how any symmetric matrix can be transformed into a similar tridiagonal one [1, 2]. This orthogonal similarity transformation forms the basic step for various algorithms. For example if one wants to compute the eigenvalues of a symmetric matrix, one can rst transform it into a similar tridiagonal one and then compute the eigenvalues of this tridiagonal matrix. Very recently an a...

متن کامل

The Lanczos-Ritz values appearing in an orthogonal similarity reduction of a matrix into semiseparable form

It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation into tridiagonal form. Once the tridiagonal matrix has been computed, several algorithms can be used to compute either the whole spectrum or part of it. In this paper, we propose an algorithm to reduce any symmetric matrix into a similar semiseparable one of semiseparability rank 1, by orthogonal...

متن کامل

Computing the rank revealing factorization of symmetric matrices by the semiseparable reduction

An algorithm for reducing a symmetric dense matrix into a symmetric semiseparable one by orthogonal similarity transformations and an efficient implementation of the QR–method for symmetric semiseparable matrices have been recently proposed. In this paper, exploiting the properties of the latter algorithms, an algorithm for computing the rank revealing factorization of symmetric matrices is con...

متن کامل

An implicit QR algorithm for semiseparable matrices to compute the eigendecomposition of symmetric matrices

The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If it is applied on a dense n×n matrix, this algorithm requires O(n3) operations per iteration step. To reduce this complexity for a symmetric matrix to O(n), the original matrix is £rst reduced to tridiagonal form using orthogonal similarity transformations. In the report [Van Barel, Vandebril, Mast...

متن کامل

Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Ritz values

It is a well-known fact that while reducing a symmetric matrix into a similar tridiagonal one, the already tridiagonal matrix in the partially reduced matrix has as eigenvalues the Lanczos-Ritz values (see e.g. [Golub G. and Van Loan C.] ). This behavior is also shared by the reduction algorithm which transforms symmetric matrices via orthogonal similarity transformations to semiseparable form ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2005